The Multiple Trip Vehicle Routing Problem with Backhauls: Formulation and a Two-Level Variable Neighbourhood Search
نویسندگان
چکیده
منابع مشابه
Reactive Tabu Search and Variable Neighbourhood Descent Applied to the Vehicle Routing Problem with Backhauls
We are in the presence of the VRP with backhauls, also known as the linehaul-backhaul problem, when the vehicles are not only required to deliver goods to customers, but also to pick up goods at customers locations. An example of this partition of the set of customers could be the grocery industry. The supermarkets and shops are the linehaul customers and the grocery suppliers are the backhaul ...
متن کاملILS with Multiple Variable Neighbourhood Descendent for the Vehicle Routing Problem with Multiple Trips
This paper describes a new approach to solving the vehicle route problem with Multiple Trips. The proposed algorithm (IVNDS) is based on the Iterative Local Search meta-heuristic which uses two consecutive Variable Neighbourhood Descendent (VND) procedures in the improvement phase. The VND procedures are differentiated by the search spaces they explore. The first VND performs moves in routes of...
متن کاملA goal programming model for vehicle routing problem with backhauls and soft time windows
The vehicle routing problem with backhauls (VRPB) as an extension of the classical vehicle routing prob-lem (VRP) attempts to define a set of routes which services both linehaul customers whom product are to be delivered and backhaul customers whom goods need to be collected. A primary objective for the problem usually is minimizing the total distribution cost. Most real-life problems have othe...
متن کاملA vehicle routing problem with backhauls and time windows: a guided local search solution
This paper presents a guided local search heuristic to solve a vehicle routing problem with backhauls and time windows. The VRPBTW with and without customer precedence are both considered. Customer precedence requires that all linehaul customers be visited before any backhaul customer. The basic approach is to construct an initial infeasible solution and then use a guided local search to improv...
متن کاملA new tabu search algorithm for the vehicle routing problem with backhauls
In the distribution of goods from a central depot to geographically dispersed customers happens quite frequently that some customers, called linehauls, receive goods from that depot while others, named backhauls, send goods to it. This situation is described and studied by the vehicle routing problem with backhauls. In this paper we present a new tabu search algorithm that starting from pseudo-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2017
ISSN: 0305-0548
DOI: 10.1016/j.cor.2015.12.017